Nanotechnology and cancer

The biological picture of cancer is rapidly advancing from models built from phenomenological descriptions to network models derived from systems biology, which can capture the evolving pathophysiology of the disease at the molecular level. The translation of this (still academic) picture into a clinically relevant framework can be enabling for the war on cancer, but it is a scientific and technological challenge. In this review, we discuss emerging in vitro diagnostic technologies and therapeutic approaches that are being developed to handle this challenge. Our discussion of in vitro diagnostics is guided by the theme of making large numbers of measurements accurately, sensitively, and at very low cost. We discuss diagnostic approaches based on microfluidics and nanotechnology. We then review the current state of the art of nanoparticle-based therapeutics that have reached the clinic. The goal of the presentation is to identify nanotherapeutic strategies that are designed to increase efficacy while simultaneously minimizing the toxic side effects commonly associated with cancer chemotherapies

The UV absorption spectrum of C60 (buckminsterfullerene): A narrow band at 3860 Å

The absorption spectrum of the special C60 cluster buckminsterfullerene has been studied in a supersonic beam by laser depletion of the cold van der Waals complexes of C60 with benzene and methylene chloride. Both complexes were found to display a single, isolated absorption band in the near ultraviolet superimposed on a structureless absorption continuum. For the methylene chloride complex this feature is centered at 3860 Å, and is roughly 50 cm−1 wide. In the benzene van der Waals cluster, the corresponding feature is located at 3863 Å, and has a similar width. This spectrum is tentatively assigned to the 0–0 band of the lowest 1T1u<--1Ag (LUMO+1<--HOMO) transition of a truncated icosahedral carbon shell structure, broadened by coupling to the underlying quasicontinuum of ground state vibrational levels

Permutation groups, simple groups and sieve methods

We show that the number of integers n ≤ x which occur as indices of subgroups of nonabelian finite simple groups, excluding that of An-1 in An, is ∼ hx/log x, for some given constant h. This might be regarded as a noncommutative analogue of the Prime Number Theorem (which counts indices n ≤ x of subgroups of abelian simple groups). We conclude that for most positive integers n, the only quasiprimitive permutation groups of degree n are Sn and An in their natural action. This extends a similar result for primitive permutation groups obtained by Cameron, Neumann and Teague in 1982. Our proof combines group-theoretic and number-theoretic methods. In particular, we use the classification of finite simple groups, and we also apply sieve methods to estimate the size of some interesting sets of primes

A discontinuous Galerkin method for the Vlasov-Poisson system

A discontinuous Galerkin method for approximating the Vlasov-Poisson system of equations describing the time evolution of a collisionless plasma is proposed. The method is mass conservative and, in the case that piecewise constant functions are used as a basis, the method preserves the positivity of the electron distribution function and weakly enforces continuity of the electric field through mesh interfaces and boundary conditions. The performance of the method is investigated by computing several examples and error estimates associated system's approximation are stated. In particular, computed results are benchmarked against established theoretical results for linear advection and the phenomenon of linear Landau damping for both the Maxwell and Lorentz distributions. Moreover, two nonlinear problems are considered: nonlinear Landau damping and a version of the two-stream instability are computed. For the latter, fine scale details of the resulting long-time BGK-like state are presented. Conservation laws are examined and various comparisons to theory are made. The results obtained demonstrate that the discontinuous Galerkin method is a viable option for integrating the Vlasov-Poisson system.Comment: To appear in Journal for Computational Physics, 2011. 63 pages, 86 figure

Density of non-residues in Burgess-type intervals and applications

We show that for any fixed \eps>0, there are numbers $\delta>0$ and $p_0\ge 2$ with the following property: for every prime $p\ge p_0$ and every integer $N$ such that p^{1/(4\sqrt{e})+\eps}\le N\le p, the sequence $1,2,...,N$ contains at least $\delta N$ quadratic non-residues modulo $p$. We use this result to obtain strong upper bounds on the sizes of the least quadratic non-residues in Beatty and Piatetski--Shapiro sequences.Comment: In the new version we use an idea of Roger Heath-Brown (who is now a co-author) to simply the proof and improve the main results of the previous version, 14 page

Improving Performance of Iterative Methods by Lossy Checkponting

Iterative methods are commonly used approaches to solve large, sparse linear systems, which are fundamental operations for many modern scientific simulations. When the large-scale iterative methods are running with a large number of ranks in parallel, they have to checkpoint the dynamic variables periodically in case of unavoidable fail-stop errors, requiring fast I/O systems and large storage space. To this end, significantly reducing the checkpointing overhead is critical to improving the overall performance of iterative methods. Our contribution is fourfold. (1) We propose a novel lossy checkpointing scheme that can significantly improve the checkpointing performance of iterative methods by leveraging lossy compressors. (2) We formulate a lossy checkpointing performance model and derive theoretically an upper bound for the extra number of iterations caused by the distortion of data in lossy checkpoints, in order to guarantee the performance improvement under the lossy checkpointing scheme. (3) We analyze the impact of lossy checkpointing (i.e., extra number of iterations caused by lossy checkpointing files) for multiple types of iterative methods. (4)We evaluate the lossy checkpointing scheme with optimal checkpointing intervals on a high-performance computing environment with 2,048 cores, using a well-known scientific computation package PETSc and a state-of-the-art checkpoint/restart toolkit. Experiments show that our optimized lossy checkpointing scheme can significantly reduce the fault tolerance overhead for iterative methods by 23%~70% compared with traditional checkpointing and 20%~58% compared with lossless-compressed checkpointing, in the presence of system failures.Comment: 14 pages, 10 figures, HPDC'1